翻訳と辞書 |
Biregular graph : ウィキペディア英語版 | Biregular graph
In graph-theoretic mathematics, a biregular graph〔.〕 or semiregular bipartite graph〔.〕 is a bipartite graph for which every two vertices on the same side of the given bipartition have the same degree as each other. If the degree of the vertices in is and the degree of the vertices in is , then the graph is said to be -biregular. ==Example== Every complete bipartite graph is -biregular.〔 The rhombic dodecahedron is another example; it is (3,4)-biregular.〔.〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Biregular graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|